Short Exponent Diffie-Hellman Problems
نویسندگان
چکیده
In this paper, we study short exponent Diffie-Hellman problems, where significantly many lower bits are zeros in the exponent. We first prove that the decisional version of this problem is as hard as two well known hard problems, the standard decisional Diffie-Hellman problem (DDH) and the short exponent discrete logarithm problem. It implies that we can improve the efficiency of ElGamal scheme and Cramer-Shoup scheme under the two widely accepted assumptions. We next derive a similar result for the computational version of this problem.
منابع مشابه
Diffie-Hellman type key exchange protocols based on isogenies
In this paper, we propose some Diffie-Hellman type key exchange protocols using isogenies of elliptic curves. The first method which uses the endomorphism ring of an ordinary elliptic curve $ E $, is a straightforward generalization of elliptic curve Diffie-Hellman key exchange. The method uses commutativity of the endomorphism ring $ End(E) $. Then using dual isogenies, we propose...
متن کاملOn the q-Strong Diffie-Hellman Problem
This note is an exposition of reductions among the q-strong Diffie-Hellman problem and related problems. 1 The q-Strong Diffie-Hellman Problem We discuss reductions among the q-strong Diffie-Hellman (q-sDH) problem [1, 3] and related problems. We use the following notation: 1. G1 and G2 are two cyclic groups of prime order p. 2. g1 is a generator of G1 and g2 is a generator of G2. 3. ψ is an is...
متن کاملSecure Hashed Diffie-Hellman over Non-DDH Groups
We show that in applications that use the Diffie-Hellman (DH) transform but take care of hashing the DH output (as required, for example, for secure DH-based encryption and key exchange) the usual requirement to work over a DDH group, i.e., a group in which the Decisional Diffie-Hellman assumption holds, can be relaxed to only requiring that the DH group contains a large enough DDH subgroup. In...
متن کاملA New Construction of Short Hierarchical Identity-based Signature in the Standard Model
In this paper, a new short hierarchical identity-based signature (HIBS) scheme is proposed in the standard model. This scheme has some advantages over the available schemes: the private keys size shrinks as the identity depth increases and the signature size is constant as it consists of three group elements. Furthermore, under the generalization selective-identity security model, we reduce the...
متن کاملThe Kernel Matrix Diffie-Hellman Assumption
We put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. Given some matrix A sampled from some distribution D, the kernel assumption says that it is hard to find “in the exponent” a nonzero vector in the kernel of A>. This family is a natural computational analogue of the Matrix Decisional Diffie-Hellman Assumption (MDDH), proposed by Escala et al. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004